On Randomized Semi-algebraic Test Complexity
نویسندگان
چکیده
منابع مشابه
Complexity of Semi-algebraic Proofs
It is a known approach to translate propositional formulas into systems of polynomial inequalities and consider proof systems for the latter. The well-studied proof systems of this type are the Cutting Plane proof system (CP) utilizing linear inequalities and the Lovász– Schrijver calculi (LS) utilizing quadratic inequalities. We introduce generalizations LS of LS that operate on polynomial ine...
متن کاملEssential Convexity and Complexity of Semi-Algebraic Constraints
Let Γ be a structure with a finite relational signature and a first-order definition in (R; ∗,+) with parameters from R, that is, a relational structure over the real numbers where all relations are semi-algebraic sets. In this article, we study the computational complexity of constraint satisfaction problem (CSP) for Γ: the problem to decide whether a given primitive positive sentence is true ...
متن کاملOn the topology of semi-algebraic functions on closed semi-algebraic sets
We consider a closed semi-algebraic set X ⊂ R and a C semi-algebraic function f : R → R such that f|X has a finite number of critical points. We relate the topology of X to the topology of the sets {f ∗ α}, where ∗ ∈ {≤,=,≥} and α ∈ R, and the indices of the critical points of f|X and −f|X . We also relate the topology of X to the topology of the links at infinity of the sets {f ∗ α} and the in...
متن کاملSemi-algebraic neighborhoods of closed semi-algebraic sets
— Given a closed (not necessarly compact) semi-algebraic set X in Rn, we construct a non-negative semi-algebraic C2 function f such that X=f−1(0) and such that for δ > 0 sufficiently small, the inclusion of X in f−1([0, δ]) is a retraction. As a corollary, we obtain several formulas for the Euler characteristic of X. Résumé. — Étant donné un ensemble semi-algébrique fermé (non nécessairement co...
متن کاملOn the complexity of Gröbner basis computation of semi-regular overdetermined algebraic equations
We extend the notion of regular sequence ([Mac16]) to overdetermined system of algebraic equations. We study generic properties of Gröbner bases and analyse precisely the behavior of the F5 [Fau02] algorithm. Sharp asymptotic estimates of the degree of regularity are given. We consider polynomials (f1, . . . , fm) in k[x1, . . . , xn] where k is a field. In this extended abstract, we restrict a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Complexity
سال: 1993
ISSN: 0885-064X
DOI: 10.1006/jcom.1993.1016